Guaranteed Passive Parameterized Admittance-Based Macromodeling
نویسندگان
چکیده
منابع مشابه
Matrix nearness-based guaranteed passive system approximation
In this paper we present a new approach towards global passive approximation in order to find a passive real-rational transfer function G(s) that is an arbitrarily close approximation of the passive transfer function nearest to a non-passive square transfer function H(s). It is based on existing solutions to pertinent matrix nearness problems. It is shown that the key point in constructing the ...
متن کاملPassive Admittance Matrix Modeling for Guitar Synthesis
In physics-based sound synthesis, it is generally possible to incorporate a mechanical or acoustical immittance (admittance or impedance) in the form of a digital filter. Examples include modeling of the termination of a string or a tube. However, when digital filters are fitted to measured immittance data, care has to be taken that the resulting filter corresponds to a passive mechanical or ac...
متن کاملParametric macromodeling based on amplitude and frequency scaled systems with guaranteed passivity
We propose a novel parametric macromodeling method for systems described by scattering parameters, which depend on multiple design variables such as geometrical layout or substrate features. It is able to build accurate multivariate macromodels that are stable and passive over the entire design space. Poles and residues are parameterized indirectly. The proposed method is based on an efficient ...
متن کاملDelay extraction-based passive macromodeling techniques for transmission line type interconnects characterized by tabulated multiport data
This paper introduces a novel algorithm for delay extraction-based passive macromodeling of multiconductor transmission line type interconnects characterized by multiport (Y, Z, S, or H) tabulated parameters. The algorithm determines a unique logarithm of the H parameters, which is then approximated using a low-order rational function. Subsequently, the DEPACT (delay extractionbased passive com...
متن کاملThe Linear Arrangement Problem Parameterized Above Guaranteed Value
A linear arrangement (LA) is an assignment of distinct integers to the vertices of a graph. The cost of an LA is the sum of lengths of the edges of the graph, where the length of an edge is defined as the absolute value of the difference of the integers assigned to its ends. For many application one hopes to find an LA with small cost. However, it is a classical NP-complete problem to decide wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Advanced Packaging
سال: 2010
ISSN: 1521-3323,1557-9980
DOI: 10.1109/tadvp.2009.2029242